Testing Positiveness of Polynomials
Identifieur interne : 00B315 ( Main/Exploration ); précédent : 00B314; suivant : 00B316Testing Positiveness of Polynomials
Auteurs : Hoon Hong [États-Unis] ; Dalibor Jakuš [Autriche]Source :
- Journal of Automated Reasoning [ 0168-7433 ] ; 1998-08-01.
English descriptors
Abstract
Abstract: Many problems in mathematics, logic, computer science, and engineering can be reduced to the problem of testing positiveness of polynomials (over real numbers). Although the problem is decidable (shown by Tarski in 1930), the general decision methods are not always practically applicable because of their high computational time requirements. Thus several partial methods were proposed in the field of term rewriting systems. In this paper, we exactly determine how partial these methods are, and we propose simpler and/or more efficient methods with the same power.
Url:
DOI: 10.1023/A:1005983105493
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001629
- to stream Istex, to step Curation: 001610
- to stream Istex, to step Checkpoint: 002547
- to stream Main, to step Merge: 00BA37
- to stream Main, to step Curation: 00B315
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Testing Positiveness of Polynomials</title><author><name sortKey="Hong, Hoon" sort="Hong, Hoon" uniqKey="Hong H" first="Hoon" last="Hong">Hoon Hong</name></author><author><name sortKey="Jakus, Dalibor" sort="Jakus, Dalibor" uniqKey="Jakus D" first="Dalibor" last="Jakuš">Dalibor Jakuš</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5FFD20E1164F90AD9281AA7791A546E8272E2802</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1023/A:1005983105493</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-6077G5G3-5/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001629</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001629</idno><idno type="wicri:Area/Istex/Curation">001610</idno><idno type="wicri:Area/Istex/Checkpoint">002547</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002547</idno><idno type="wicri:doubleKey">0168-7433:1998:Hong H:testing:positiveness:of</idno><idno type="wicri:Area/Main/Merge">00BA37</idno><idno type="wicri:Area/Main/Curation">00B315</idno><idno type="wicri:Area/Main/Exploration">00B315</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Testing Positiveness of Polynomials</title><author><name sortKey="Hong, Hoon" sort="Hong, Hoon" uniqKey="Hong H" first="Hoon" last="Hong">Hoon Hong</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Caroline du Nord</region></placeName><wicri:cityArea>Department of Mathematics, North Carolina State University, 27695-8205, Raleigh</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Jakus, Dalibor" sort="Jakus, Dalibor" uniqKey="Jakus D" first="Dalibor" last="Jakuš">Dalibor Jakuš</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Research Institute for Symbolic Computation, Johannes Kepler University, A-4040, Linz</wicri:regionArea><wicri:noRegion>Linz</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Autriche</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Automated Reasoning</title><title level="j" type="abbrev">Journal of Automated Reasoning</title><idno type="ISSN">0168-7433</idno><idno type="eISSN">1573-0670</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1998-08-01">1998-08-01</date><biblScope unit="volume">21</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="23">23</biblScope><biblScope unit="page" to="38">38</biblScope></imprint><idno type="ISSN">0168-7433</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0168-7433</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>positiveness of polynomials</term><term>term rewrite systems</term><term>termination proofs</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Many problems in mathematics, logic, computer science, and engineering can be reduced to the problem of testing positiveness of polynomials (over real numbers). Although the problem is decidable (shown by Tarski in 1930), the general decision methods are not always practically applicable because of their high computational time requirements. Thus several partial methods were proposed in the field of term rewriting systems. In this paper, we exactly determine how partial these methods are, and we propose simpler and/or more efficient methods with the same power.</div></front></TEI><affiliations><list><country><li>Autriche</li><li>États-Unis</li></country><region><li>Caroline du Nord</li></region></list><tree><country name="États-Unis"><region name="Caroline du Nord"><name sortKey="Hong, Hoon" sort="Hong, Hoon" uniqKey="Hong H" first="Hoon" last="Hong">Hoon Hong</name></region><name sortKey="Hong, Hoon" sort="Hong, Hoon" uniqKey="Hong H" first="Hoon" last="Hong">Hoon Hong</name></country><country name="Autriche"><noRegion><name sortKey="Jakus, Dalibor" sort="Jakus, Dalibor" uniqKey="Jakus D" first="Dalibor" last="Jakuš">Dalibor Jakuš</name></noRegion><name sortKey="Jakus, Dalibor" sort="Jakus, Dalibor" uniqKey="Jakus D" first="Dalibor" last="Jakuš">Dalibor Jakuš</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B315 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B315 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5FFD20E1164F90AD9281AA7791A546E8272E2802
|texte= Testing Positiveness of Polynomials
}}
| This area was generated with Dilib version V0.6.33. |  |